package rbtree

const (
	Red = iota
	Black
)

type node struct {
	Color int
	Value int
	Left  *node
	Right *node
}

func MakeTree(data []int) (T *node) {
	for _, x := range data {

	}
	return
}

func Insert(x int, T *node) {

}

func Match(T *node) bool {
	m1 := func(T *node) bool {
		if T.Color != Black {
			return false
		}

	}
	return false
}

func Balance() {

}
